|
Hans Zantema (1956) is a Dutch mathematician and computer scientist, and professor at Radboud University in Nijmegen, known for his work on termination analysis.〔Arts, Thomas, and Jürgen Giesl. "Termination of term rewriting using dependency pairs." ''Theoretical Computer Science'' 236.1 (2000): 133-178.〕〔Ohlebusch, Enno. ''Advanced topics in term rewriting.'' Springer, 2002.〕 == Biography == Born in Goingarijp, The Netherlands, Zantema received his PhD in algebraic number theory in 1983 at the University of Amsterdam under supervision of Hendrik Lenstra Jr. for the thesis, entitled "Integer Valued Polynomials in Algebraic Number Theory." After graduation Zantema spend a few years of employment in industry he switched to computer science: from 1987 to 2000 at Utrecht University and since 2000 at Eindhoven University of Technology. Since 2007 he is a part-time full professor at Radboud University in Nijmegen. His main achievements are in term rewriting systems, in particular in automatically proving termination of term rewriting. His name is attached to Zantema's problem,〔Thierry Coquand and Henrik Persson. A proof-theoretical investigation of Zantema's problem. Computer Science Logic. Lecture Notes in Computer Science Volume 1414, pp. 177-188, Springer, 1988.〕 namely does the string rewrite system ''0011 -> 111000'' terminate. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hans Zantema」の詳細全文を読む スポンサード リンク
|